Ensuring Pareto Optimality by Referendum Voting

نویسندگان

  • Ipek Özkal-Sanver
  • M. Remzi Sanver
چکیده

We consider a society confronting the decision of accepting or rejecting a list of (at least two) proposals. Assuming separability of preferences, we show the impossibility of guaranteeing Pareto optimal outcomes through anonymous referendum voting, except for the case of an odd number of voters confronting precisely two proposals. In this special case, majority voting is the only anonymous social choice rule which guarantees Pareto optimal referendum outcomes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategy-proofness, Pareto optimality and strictly convex norms

A voting scheme assigns to each profile of alternatives chosen by n individuals a compromise alternative. Here the set of alternatives is represented by the Euclidean plane. The individual utilities for the compromise point are equal to the negatives of the distances of this point to the individually best points. These distances are measured by a given strictly convex norm, common to all agents...

متن کامل

Stability set, Pareto-optimality and single-peaked preferences

The emptiness of the core of a voting game can be viewed as the failure of a society to select a stable alternative : every alternative can be vetoed by a winning coalition. To solve this problem, also known as the paradox of voting, Rubinstein (1980) introduces the stability set by a clause of prudence in the core dominance relation which amounts to assume that individuals are aware of possibl...

متن کامل

Optimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone

In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.

متن کامل

Solution of Multi-Objective optimal reactive power dispatch using pareto optimality particle swarm optimization method

For multi-objective optimal reactive power dispatch (MORPD), a new approach is proposed where simultaneous minimization of the active power transmission loss, the bus voltage deviation and the voltage stability index of a power system are achieved. Optimal settings of continuous and discrete control variables (e.g. generator voltages, tap positions of tap changing transformers and the number of...

متن کامل

Distribution of coalitional power under probabilistic voting procedures

Pattanaik and Peleg (1986) imposed regularity, ex-post Pareto optimality and independence of irrelevant alternatives on a probabilistic voting procedure and showed that: (i) the distribution of coalitional power for decisiveness in two-alternative feasible sets is subadditive in general, but additive if the universal set has at least four alternatives; and (ii) the distribution of coalitional p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Social Choice and Welfare

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2006